The generator matrix

 1  0  0  0  1  1  1  0  1  1  1  1  0  0  0  X  1  1  1  1  1  0  1  0  1  1  0  0  X  X  X  X  X  0  1  1  1  1  1  1  1  1  0  1  X  1  X  1  X  1  X  1  X  1  X  0  1  1  X  1  X  0  0  1  1  1  1  0  X  1  1  X  1  X  X  0  X  0  0  X  0  0
 0  1  0  0  X  1 X+1  1  0  1  X X+1  1  X  1  1  0  1  0  1  X  1 X+1  0  X X+1  1  0  1  0  X  1  1  1  0  1  X X+1  0  1  X X+1  1  X  1  X  1  X  1  X  1  1  0  1  0  X X+1  1  X X+1  X  X  0  1 X+1 X+1  0  1  1  0  0  1  0  1  1  1  1  1  1  1  1  1
 0  0  1  0  0  0  0  X  1  1  1  1 X+1  1  1  0  X  X X+1 X+1  X X+1  X  1 X+1 X+1  X  X  1  1  1 X+1  X  0  0  0  X  X  X  X  0  0  1  0 X+1  1  X  X  1 X+1  0 X+1  X  1  0  1  1  X  0 X+1  X  1  1  0  0  X X+1 X+1  X  1  X X+1  0  1  0  1  0  1  1  X X+1  1
 0  0  0  1  1 X+1  X X+1 X+1  0  X  1  X  1 X+1  1  X  1  1  X X+1  1  0  X  0 X+1  X  1  0 X+1  1  X X+1  1  X  1  X  1  0 X+1  0 X+1  0 X+1  1  0  X  1 X+1  X  0 X+1  1  1  1  1 X+1  0  1  1  1 X+1  1  X  0  X  0  0  0  X X+1 X+1  1  1 X+1  1  X X+1  X  1 X+1 X+1

generates a code of length 82 over Z2[X]/(X^2) who´s minimum homogenous weight is 80.

Homogenous weight enumerator: w(x)=1x^0+138x^80+64x^82+32x^84+21x^96

The gray image is a linear code over GF(2) with n=164, k=8 and d=80.
As d=80 is an upper bound for linear (164,8,2)-codes, this code is optimal over Z2[X]/(X^2) for dimension 8.
This code was found by Heurico 1.16 in 26.4 seconds.